Generalised Jacobians in Cryptography and Coding Theory
نویسنده
چکیده
The use of generalised Jacobians in discrete logarithm based cryptosystems has so far been rather limited since they offer no advantage over traditional discrete logarithm based systems. In this paper we continue the search for possible applications in two directions. Firstly, we investigate pairings on generalised Jacobians and show that these are insecure. Secondly, generalising and extending prior work, we show how the discrete logarithm problem in generalised Jacobians can be reduced to the minimal non zero weight word and maximum likelihood decoding problems in generalised algebraic geometric codes.
منابع مشابه
Arithmetic of Generalized Jacobians
This paper aims at introducing generalized Jacobians as a new candidate for discrete logarithm (DL) based cryptography. The motivation for this work came from the observation that several practical DL-based cryptosystems, such as ElGamal, the Elliptic and Hyperelliptic Curve Cryptosystems, XTR, LUC as well as CEILIDH can all naturally be reinterpreted in terms of generalized Jacobians. However,...
متن کاملJacobians of singularized spectral curves and completely integrable systems
We state two recent results concerning the linearization of integrable systems on generalised Jacobians. Then we apply this to the (complexified) spherical pendulum.
متن کاملExhibiting Sha[2] on Hyperelliptic Jacobians
We discuss approaches to computing in the Shafarevich-Tate group of Jacobians of higher genus curves, with an emphasis on the theory and practice of visualisation. Especially for hyperelliptic curves, this often enables the computation of ranks of Jacobians, even when the 2-Selmer bound does not bound the rank sharply. This was previously only possible for a few special cases. For curves of gen...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملOn the security of generalized Jacobian cryptosystems
Generalized Jacobians are natural candidates to use in discrete logarithm (DL) based cryptography since they include the multiplicative group of nite elds, algebraic tori, elliptic curves as well as all Jacobians of curves. This observation therefore raised the possibility that other families of generalized Jacobians may be of cryptographic interest. This exploration began with the study of t...
متن کامل